R O M a a Uniied Multidimensional Approach to Extrusion, Sweeping, Ooset and Minkowski Sum

نویسنده

  • Alberto Paoluzzi
چکیده

AAA 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prediction of Extrusion Pressure in Vortex Extrusion Using a Streamline Approach

Vortex extrusion (VE) is a severe plastic deformation technique which is based on the synergies between high strain accumulation and high hydrostatic pressure. Such a high amount of pressure, places a mandate to seek the method for investigation of the load under processing conditions. For this, kinematically admissible velocity field and upper bound terms based on Bezier formulation are develo...

متن کامل

Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons

We consider the approximation of two NP-hard problems: Minkowski Decomposition (MinkDecomp) of integral lattice polygons, and the related Multidimensional Subset Sum (kD-SS). We prove, through a gap-preserving reduction, that, for general dimension k, kD-SS does not have an FPTAS. For 2D-SS, we present an O(n/ ) approximation algorithm, where n is the set cardinality and bounds the approximatio...

متن کامل

Minkowski Sum Selection and Finding

Let P,Q ⊆ R be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ R, r = [y ], and b ∈ R. Define the constrained Minkowski sum (P ⊕Q)Ar≥b as the multiset {(p+ q)|p ∈ P, q ∈ Q,A(p+ q) ≥ b}. Given P , Q, Ar ≥ b, an objective function f : R → R, and a positive integer k, the Minkowski Sum Selection problem is to find the k largest objective value among all objective ...

متن کامل

Constrained Minkowski Sum Selection and Finding

Let P,Q ⊆ R be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ Rλ×2, r = [y ], and b ∈ R. Define the constrained Minkowski sum (P ⊕Q)Ar≥b as the multiset {(p + q)|p ∈ P, q ∈ Q,A(p + q) ≥ b}. Given P , Q, Ar ≥ b, an objective function f : R → R, and a positive integer k, the Minkowski Sum Selection Problem is to find the k largest objective value among all objec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997